On Vietoris Soft Topology I

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Approximation theorems for fuzzy set multifunctions in Vietoris topology. Physical implications of regularity

n this paper, we consider continuity properties(especially, regularity, also viewed as an approximation property) for $%mathcal{P}_{0}(X)$-valued set multifunctions ($X$ being a linear,topological space), in order to obtain Egoroff and Lusin type theorems forset multifunctions in the Vietoris hypertopology. Some mathematicalapplications are established and several physical implications of thema...

متن کامل

Fuzzy Soft Topology

In the present paper we introduce the topological structure of fuzzy soft sets and fuzzy soft continuity of fuzzy soft mappings. We show that a fuzzy soft topological space gives a parametrized family of fuzzy topological spaces. Furthermore, with the help of an example it is shown that the constant mapping is not continuous in general. Then the notions of fuzzy soft closure and interior are in...

متن کامل

SOFT TOPOLOGY AND SOFT PROXIMITY AS FUZZY PREDICATES BY FORMULAE OF LUKASIEWICZ LOGIC

In this paper, based in the L ukasiewicz logic, the definition offuzzifying soft neighborhood structure and fuzzifying soft continuity areintroduced. Also, the fuzzifying soft proximity spaces which are ageneralizations of the classical soft proximity spaces are given. Severaltheorems on classical soft proximities are special cases of the theorems weprove in this paper.

متن کامل

Vietoris Bisimulations

Building on the fact that descriptive frames are coalgebras for the Vietoris functor on the category of Stone spaces, we introduce and study the concept of a Vietoris bisimulation between two descriptive modal models, together with the associated notion of bisimilarity. We prove that our notion of bisimilarity, which is defined in terms of relation lifting, coincides with Kripke bisimilarity (w...

متن کامل

On the topology of algorithms, I

We call such an algorithm a computation tree. A computation tree for the problem Poly(d) has input the coefficients of a polynomial f (in terms of real and imaginary parts). The output must consist of (z,, . . . , zd) (again given in terms of real and imaginary parts), each zi being within E of {i, the <i being the roots off. The computation nodes do not contribute to the topology of the comput...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Scientific Research

سال: 2016

ISSN: 2070-0245,2070-0237

DOI: 10.3329/jsr.v8i1.23440